Singular random matrix decompositions: Jacobians
نویسندگان
چکیده
منابع مشابه
More about measures and Jacobians of singular random matrices
In this work are studied the Jacobians of certain singular transformations and the corresponding measures which support the jacobian computations.
متن کاملmore about measures and jacobians of singular random matrices
in this work are studied the jacobians of certain singular transformations and the corresponding measures which support the jacobian computations.
متن کاملMatrix Decompositions Using sub-Gaussian Random Matrices
In recent years, several algorithms which approximate matrix decomposition have been developed. These algorithms are based on metric conservation features for linear spaces of random projection types. We present a new algorithm, which achieves with high probability a rank-r SVD approximation of an n × n matrix and derive an error bound that does not depend on the first r singular values. Althou...
متن کاملContinuation of Singular Value Decompositions
In this work we consider computing a smooth path for a (block) singular value decomposition of a full rank matrix valued function. We give new theoretical results and then introduce and implement several algorithms to compute a smooth path. We illustrate performance of the algorithms with a few numerical examples.
متن کاملShort Loop Decompositions of Surfaces and the Geometry of Jacobians
Given a Riemannian surface, we consider a naturally embedded graph which captures part of the topology and geometry of the surface. By studying this graph, we obtain results in three different directions. First, we find bounds on the lengths of homologically independent curves on closed Riemannian surfaces. As a consequence, we show that for any λ ∈ (0, 1) there exists a constant Cλ such that e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Multivariate Analysis
سال: 2005
ISSN: 0047-259X
DOI: 10.1016/j.jmva.2004.03.002